Cognitive Weighted Method Hiding Factor Complexity Metric
نویسندگان
چکیده
Method hiding plays a key role by serving the foundation for several guidelines in object-oriented software design. It brings about plethora of benefits such as easy comprehension, secured accessibility, modifiability without side-effects, modular testing, higher reliability etc. But, it has to be handled carefully since very low method hiding may result in insufficiently abstracted implementation and very high method hiding will lead to very little functionality. Hence, the method hiding factor has to be measured accurately in order to produce quality software. This article, proposes a new Cognitive Weighted Method Hiding Factor (CWMHF) complexity metric. It measures not only the software structural complexity, but also the cognitive complexity on the basis of type. The cognitive weights are calibrated based on 27 empirical studies with 120 persons. A case study and experimentation of the new software metric shows encouraging results. Further, a comparative study is made and the correlation test has proved that CWMHF complexity metric is a better, more realistic, and more comprehensive indicator of the software complexity than the existing Abreu’s Method Hiding Factor complexity metric.
منابع مشابه
Cognitive Weighted Polymorphism Factor: A Comprehension Augmented Complexity Metric
Polymorphism is one of the main pillars of objectoriented paradigm. It induces hidden forms of class dependencies which may impact software quality, resulting in higher cost factor for comprehending, debugging, testing, and maintaining the software. In this paper, a new cognitive complexity metric called Cognitive Weighted Polymorphism Factor (CWPF) is proposed. Apart from the software structur...
متن کاملROBUSTNESS OF THE TRIPLE IMPLICATION INFERENCE METHOD BASED ON THE WEIGHTED LOGIC METRIC
This paper focuses on the robustness problem of full implication triple implication inference method for fuzzy reasoning. First of all, based on strong regular implication, the weighted logic metric for measuring distance between two fuzzy sets is proposed. Besides, under this metric, some robustness results of the triple implication method are obtained, which demonstrates that the triple impli...
متن کاملA Survey on Metric of Software Cognitive Complexity for OO design
In modern era, the biggest challenge facing the software industry is the upcoming of new technologies. So, the software engineers are gearing up themselves to meet and manage change in large software system. Also they find it difficult to deal with software cognitive complexities. In the last few years many metrics were proposed to measure the cognitive complexity of software. This paper aims a...
متن کاملWeighted Class Complexity: A Measure of Complexity for Object Oriented Systems
Software complexity metrics are used to predict critical information about reliability and maintainability of software systems. Object oriented software development requires a different approach to software complexity metrics. In this paper, we propose a metric to compute the structural and cognitive complexity of class by associating a weight to the class, called as Weighted Class Complexity (...
متن کاملLow Complexity and High speed in Leading DCD ERLS Algorithm
Adaptive algorithms lead to adjust the system coefficients based on the measured data. This paper presents a dichotomous coordinate descent method to reduce the computational complexity and to improve the tracking ability based on the variable forgetting factor when there are a lot of changes in the system. Vedic mathematics is used to implement the multiplier and the divider in the VFF equatio...
متن کامل